首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   2664篇
  免费   68篇
  国内免费   145篇
化学   975篇
晶体学   8篇
力学   134篇
综合类   10篇
数学   919篇
物理学   831篇
  2024年   1篇
  2023年   90篇
  2022年   64篇
  2021年   62篇
  2020年   62篇
  2019年   57篇
  2018年   43篇
  2017年   72篇
  2016年   72篇
  2015年   73篇
  2014年   131篇
  2013年   177篇
  2012年   131篇
  2011年   156篇
  2010年   165篇
  2009年   191篇
  2008年   175篇
  2007年   191篇
  2006年   146篇
  2005年   98篇
  2004年   95篇
  2003年   84篇
  2002年   62篇
  2001年   45篇
  2000年   47篇
  1999年   43篇
  1998年   38篇
  1997年   50篇
  1996年   55篇
  1995年   27篇
  1994年   36篇
  1993年   22篇
  1992年   19篇
  1991年   14篇
  1990年   10篇
  1989年   10篇
  1988年   12篇
  1987年   8篇
  1986年   4篇
  1985年   6篇
  1984年   8篇
  1983年   7篇
  1982年   3篇
  1981年   5篇
  1980年   1篇
  1978年   5篇
  1977年   2篇
  1972年   1篇
  1969年   1篇
排序方式: 共有2877条查询结果,搜索用时 218 毫秒
1.
2.
We consider spatially extended systems of interacting nonlinear Hawkes processes modeling large systems of neurons placed in Rd and study the associated mean field limits. As the total number of neurons tends to infinity, we prove that the evolution of a typical neuron, attached to a given spatial position, can be described by a nonlinear limit differential equation driven by a Poisson random measure. The limit process is described by a neural field equation. As a consequence, we provide a rigorous derivation of the neural field equation based on a thorough mean field analysis.  相似文献   
3.
We consider the problem of sending a message from a sender s to a receiver r through an unreliable network by specifying in a protocol what each vertex is supposed to do if it receives the message from one of its neighbors. A protocol for routing a message in such a graph is finite if it never floods r with an infinite number of copies of the message. The expected reliability of a given protocol is the probability that a message sent from s reaches r when the edges of the network fail independently with probability 1?p.We discuss, for given networks, the properties of finite protocols with maximum expected reliability in the case when p is close to 0 or 1, and we describe networks for which no one protocol is optimal for all values of p. In general, finding an optimal protocol for a given network and fixed probability is challenging and many open problems remain.  相似文献   
4.
The aim of this paper is to present a new classification and regression algorithm based on Artificial Intelligence. The main feature of this algorithm, which will be called Code2Vect, is the nature of the data to treat: qualitative or quantitative and continuous or discrete. Contrary to other artificial intelligence techniques based on the “Big-Data,” this new approach will enable working with a reduced amount of data, within the so-called “Smart Data” paradigm. Moreover, the main purpose of this algorithm is to enable the representation of high-dimensional data and more specifically grouping and visualizing this data according to a given target. For that purpose, the data will be projected into a vectorial space equipped with an appropriate metric, able to group data according to their affinity (with respect to a given output of interest). Furthermore, another application of this algorithm lies on its prediction capability. As it occurs with most common data-mining techniques such as regression trees, by giving an input the output will be inferred, in this case considering the nature of the data formerly described. In order to illustrate its potentialities, two different applications will be addressed, one concerning the representation of high-dimensional and categorical data and another featuring the prediction capabilities of the algorithm.  相似文献   
5.
《Physics letters. A》2019,383(17):2028-2032
We find that the simple coupling of network growth to the position of a random walker on the network generates a traveling wave in the probability distribution of nodes visited by the walker. We argue that the entropy of this probability distribution is bounded as the network size tends to infinity. This means that the growth of a space coupled to a random walker situated in it constrains its dynamics to a set of typical random walker trajectories, and walker trajectories inside the growing space are compressible.  相似文献   
6.
7.
《Physics letters. A》2020,384(35):126886
Designing robust control schemes in n-level open quantum system is significant for quantum computation. Here, we investigate two quantum control strategies based on supervised machine learning to suppress the quantum noise in an open quantum system. One is controlling state distance and the other is governing the average of a Hermitian operator. In this process, the dynamics of the system is mapped to a neural network where the control fields correspond to the weights. Besides, the system is transformed into the coherence Bloch space without using superoperator thus the complications are reduced largely. As an example, the two control protocols are demonstrated in a two-level and four-level systems, respectively. By applying these examples, the results show that the state of the system transfers to the target state and the average of a Hermitian operator to its minimum value in a given time despite disturbed by various types of noise.  相似文献   
8.
基于深度学习的方法,在HL-2A装置上开发出了一套边缘局域模(ELM)实时识别算法。算法使用5200次放电数据(约24.19万数据切片)进行学习,得到一个深度为22层的卷积神经网络。为衡量算法的识别能力,识别了HL-2A装置自2009年实现稳定ELMy H模放电以来所有历史数据(约26000次放电数据),共识别出1665次H模放电,其中误识别35次,误报率为2.10%。在实际的1634次H模放电中,漏识别4次,漏识别率为0.24%。该误报率和漏报率可以满足ELM实时识别的精度要求。识别算法在实时控制环境下,对单个时间点的平均计算时间为0.46ms,可以满足实时控制的计算速度要求。  相似文献   
9.
ABSTRACT

A new adaptive kernel principal component analysis (KPCA) for non-linear discrete system control is proposed. The proposed approach can be treated as a new proposition for data pre-processing techniques. Indeed, the input vector of neural network controller is pre-processed by the KPCA method. Then, the obtained reduced neural network controller is applied in the indirect adaptive control. The influence of the input data pre-processing on the accuracy of neural network controller results is discussed by using numerical examples of the cases of time-varying parameters of single-input single-output non-linear discrete system and multi-input multi-output system. It is concluded that, using the KPCA method, a significant reduction in the control error and the identification error is obtained. The lowest mean squared error and mean absolute error are shown that the KPCA neural network with the sigmoid kernel function is the best.  相似文献   
10.
本实验通过模拟植物光合作用,设计制备了新颖的光电联合催化池3D-ZnO/Ni BiVO4/FTO,用电化学沉积法制备了泡沫镍负载的ZnO纳米棒光电阴极和BiVO4光电阳极,以0.1 mol·L^−1 KHCO3水溶液作为电解质,1 mmol·L^−1曙红Y为光敏剂,在−0.6 V硅太阳电池的电压下光电催化还原CO2得到了乙醇、乙酸和甲醇,总产率22.5μmol·L^−1·h^−1·cm^−2。实现了将太阳能贮存为化学能并减少了空气中的CO2,加深了学生对绿色化学和植物Calvin循环机理的理解。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号